skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Frederickson, Bryce"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ABSTRACT For $$B \subseteq \mathbb F_q^m$$, the nth affine extremal number of B is the maximum cardinality of a set $$A \subseteq \mathbb F_q^n$$ with no subset, which is affinely isomorphic to B. Furstenberg and Katznelson proved that for any $$B \subseteq \mathbb F_q^m$$, the nth affine extremal number of B is $o(q^n)$ as $$n \to \infty$$. By counting affine homomorphisms between subsets of $$\mathbb F_q^n$$, we derive new bounds and give new proofs of some previously known bounds for certain affine extremal numbers. At the same time, we establish corresponding supersaturation results. We connect these bounds to certain Ramsey-type numbers in vector spaces over finite fields. For $$s,t \geq 1$$, let $$R_q(s,t)$$ denote the minimum n such that in every red–blue coloring of the one-dimensional subspaces of $$\mathbb F_q^n$$, there is either a red s-dimensional subspace or a blue t-dimensional subspace of $$\mathbb F_q^n$$. The existence of these numbers is a special case of a well-known theorem of Graham, Leeb and Rothschild. We improve the best-known upper bounds on $$R_2(2,t)$$, $$R_3(2,t)$$, $$R_2(t,t)$$ and $$R_3(t,t)$$. 
    more » « less
    Free, publicly-accessible full text available December 17, 2025
  2. Free, publicly-accessible full text available March 1, 2026